Chromatic index of finite and infinite graphs
نویسندگان
چکیده
منابع مشابه
Chromatic number of finite and infinite graphs and hypergraphs
First we state a few simple finite problems . Chromatic graphs attracted the attention of mathematicians first of all because of the four colour problem, but it was soon realized that interesting and difficult questions can be proved on chromatic graphs which have nothing to do with the four colour problem (or Appel and Haken theorem) . Tutte (and independently Ungar, Zykov and Mycielski) prove...
متن کاملChromatic Harmonic Indices and Chromatic Harmonic Polynomials of Certain Graphs
In the main this paper introduces the concept of chromatic harmonic polynomials denoted, $H^chi(G,x)$ and chromatic harmonic indices denoted, $H^chi(G)$ of a graph $G$. The new concept is then applied to finding explicit formula for the minimum (maximum) chromatic harmonic polynomials and the minimum (maximum) chromatic harmonic index of certain graphs. It is also applied to split graphs and ce...
متن کاملOn Chromatic Number of Infinite Graphs
In our paper [1.] using a special set-theoretical construction assuming the generalized continuum hypothesis (G.C.H . in what follows) we proved that the topological product of J~k discrete topological spaces of power J~ o is not k-compact for every k < co . Since then several related or equivalent problems were independently discussed in the literature . General results of A . TARSKI, P. HANF ...
متن کاملOn the Chromatic Numbers of Infinite Graphs
In this paper, we survey some of the results and open questions regarding colorings of infinite graphs. We first introduce terminology to describe finite and infinite colorings, then offer a proof of the De Bruijn-Erdős Theorem, one of the primary tool for studying the chromatic number of infinite graphs. We show how the De Bruijn-Erdős Theorem allows us to extend results of finite graphs of ar...
متن کاملTotal-Chromatic Number and Chromatic Index of Dually Chordal Graphs
A graph is dually chordal if it is the clique graph of a chordal graph. Alternatively, a graph is dually chordal if it admits a maximum neighbourhood order. This class generalizes known subclasses of chordal graphs such as doubly chordal graphs, strongly chordal graphs and interval graphs. We prove that Vizing's total-colour conjecture holds for dually chordal graphs. We describe a new heuristi...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Czechoslovak Mathematical Journal
سال: 1972
ISSN: 0011-4642,1572-9141
DOI: 10.21136/cmj.1972.101098